Simultaneously dominating all spanning trees of a graph
نویسندگان
چکیده
We investigate the problem of simultaneously dominating all spanning trees a given graph. prove that on 2-connected graphs, subset vertices dominates graph if and only it is vertex cover. Using this fact we present an exact algorithm finds simultaneous set minimum size using oracle for finding The can be implemented to run in polynomial time several classes, such as bipartite or chordal graphs. there no perfect graphs unless P=NP. Finally, provide 2-approximation set.
منابع مشابه
E ciently Scanning All Spanning Trees of an Undirected Graph
Let G be an undirected graph with V vertices and E edges. We consider the problem of enumerating all spanning trees of G: In order to explicitly output all spanning trees, the output size is of (NV ), where N is the number of spanning trees. This, however, can be compressed into (N) size. In this paper, we propose a new algorithm for enumerating all spanning trees of G in such compact form. The...
متن کاملListing all the minimum spanning trees in an undirected graph
Efficient polynomial time algorithms are well known for the minimum spanning tree problem. However, given an undirected graph with integer edge weights, minimum spanning trees may not be unique. In this article, we present an algorithm that lists all the minimum spanning trees included in the graph. The computational complexity of the algorithm is O(N(mn+ n2 log n)) in time and O(m) in space, w...
متن کاملOn Central Spanning Trees of a Graph
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically difficult and leads to an NP-complete problem.
متن کاملOn Spanning 2-trees in a Graph
A k-tree is either a complete graph on k vertices or a graph T that contains a vertex whose neighbourhood in T induces a complete graph on k vertices and whose removal results in a k-tree. A subgraph of a graph is a spanning k-tree if it is a k-tree and contains every vertex of the graph. This paper is concerned with spanning 2-trees in a graph. It is shown that spanning 2-trees have close conn...
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EJGTA : Electronic Journal of Graph Theory and Applications
سال: 2022
ISSN: ['2338-2287']
DOI: https://doi.org/10.5614/ejgta.2022.10.1.5